The stable fixtures problem : A many-to-many extension of stable roommatesIRVING, Robert W; SCOTT, Sandy.Discrete applied mathematics. 2007, Vol 155, Num 16, pp 2118-2129, issn 0166-218X, 12 p.Article

Sublinear-time parallel algorithms for matching and related problemsGOLDBERG, A. V; PLOTKIN, S. A; VAIDYA, P. M et al.Journal of algorithms (Print). 1993, Vol 14, Num 2, pp 180-213, issn 0196-6774Article

On-line algorithms for weighted bipartite matching and stable marriagesKHULLER, S; MITCHELL, S. G; VAZIRANI, V. V et al.Theoretical computer science. 1994, Vol 127, Num 2, pp 255-267, issn 0304-3975Article

Bipartite rainbow numbers of matchingsXUELIANG LI; JIANHUA TU; ZEMIN JIN et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 2575-2578, issn 0012-365X, 4 p.Article

On α-critical edges in König-Egerváry graphsLEVIT, Vadim E; MANDRESCU, Eugen.Discrete mathematics. 2006, Vol 306, Num 15, pp 1684-1693, issn 0012-365X, 10 p.Article

Graphical condensation of plane graphs : A combinatorial approachWEIGEN YAN; YEH, Yeong-Nan; FUJI ZHANG et al.Theoretical computer science. 2005, Vol 349, Num 3, pp 452-461, issn 0304-3975, 10 p.Article

Commitment under uncertainty : Two-stage stochastic matching problemsKATRIEL, Irit; KENYON-MATHIEU, Claire; UPFAL, Eli et al.Theoretical computer science. 2008, Vol 408, Num 2-3, pp 213-223, issn 0304-3975, 11 p.Article

Determining which Fibonacci (p, r)-cubes can be Z-transformation graphsLIFENGOUA; HEPINGZHANG; HAIYUAN YAO et al.Discrete mathematics. 2011, Vol 311, Num 16, pp 1681-1692, issn 0012-365X, 12 p.Article

Bipartite matching extendable graphsXIUMEI WANG; ZHENKUN ZHANG; YIXUN LIN et al.Discrete mathematics. 2008, Vol 308, Num 23, pp 5334-5341, issn 0012-365X, 8 p.Article

A note on An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphsLEE, Kangbok; LEUNG, Joseph Y.-T; PINEDO, Michael L et al.Information processing letters. 2009, Vol 109, Num 12, pp 608-610, issn 0020-0190, 3 p.Article

ACCELERATING SIMULATED ANNEALING FOR THE PERMANENT AND COMBINATORIAL COUNTING PROBLEMSBEZAKOVA, Ivona; STEFANKOVIC, Daniel; VAZIRANI, Vijay V et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1429-1454, issn 0097-5397, 26 p.Article

ON MAXIMUM COST K_T,T-FREE T-MATCHINGS OF BIPARTITE GRAPHSMAKAI, Marton.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 349-360, issn 0895-4801, 12 p.Article

On the reconstruction of binary and permutation matrices under (binary) tomographic constraintsBRUNETTI, S; DEL LUNGO, A; GRITZMANN, P et al.Theoretical computer science. 2008, Vol 406, Num 1-2, pp 63-71, issn 0304-3975, 9 p.Article

An efficient approach for the rank aggregation problemDINU, Liviu P; MANEA, Florin.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 455-461, issn 0304-3975, 7 p.Article

Perfect matchings after vertex deletionsALDRED, R. E. L; ANSTEE, R. P; LOCKE, S. C et al.Discrete mathematics. 2007, Vol 307, Num 23, pp 3048-3054, issn 0012-365X, 7 p.Article

An adjustable linear time parallel algorithm for maximum weight bipartite matchingFAYYAZI, Morteza; KAELI, David; MELEIS, Waleed et al.Information processing letters. 2006, Vol 97, Num 5, pp 186-190, issn 0020-0190, 5 p.Article

Recognizing near-bipartite Pfaffian graphs in polynomial timeASSIS MIRANDA, Alberto Alexandre; LUCCHESI, Cláudio Leonardo.Discrete applied mathematics. 2010, Vol 158, Num 12, pp 1275-1278, issn 0166-218X, 4 p.Conference Paper

Computational complexity of counting problems on 3-regular planar graphsMINGJI XIA; PENG ZHANG; WENBO ZHAO et al.Theoretical computer science. 2007, Vol 384, Num 1, pp 111-125, issn 0304-3975, 15 p.Conference Paper

On the power of Ambainis lower boundsSHENGYU ZHANG.Theoretical computer science. 2005, Vol 339, Num 2-3, pp 241-256, issn 0304-3975, 16 p.Article

The labeled perfect matching in bipartite graphsMONNOT, Jérome.Information processing letters. 2005, Vol 96, Num 3, pp 81-88, issn 0020-0190, 8 p.Article

STATELESS DISTRIBUTED GRADIENT DESCENT FOR POSITIVE LINEAR PROGRAMSAWERBUCH, Baruch; KHANDEKAR, Rohit.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2468-2486, issn 0097-5397, 19 p.Article

Maximum weight bipartite matching in matrix multiplication timeSANKOWSKI, Piotr.Theoretical computer science. 2009, Vol 410, Num 44, pp 4480-4488, issn 0304-3975, 9 p.Conference Paper

An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphsJINSHAN ZHANG; FENGSHAN BAI.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 419-429, issn 0304-3975, 11 p.Article